Π10 classes and orderable groups
نویسندگان
چکیده
منابع مشابه
Π1 classes and orderable groups
It is known that the spaces of orders on orderable computable fields can represent all Π1 classes up to Turing degree. We show that the spaces of orders on orderable computable abelian and nilpotent groups cannot represent Π1 classes in even a weak manner. Next, we consider presentations of ordered abelian groups, and we show that there is a computable ordered abelian group for which no computa...
متن کاملPolynomially orderable classes of structures
It is well known in descriptive computational complexity theory that xpoint logic captures polynomial time on the class of ordered nite structures The same is true on any class of structures on which a polynomial number of orders are de nable in xpoint logic We call a class having this property polynomially orderable We investigate this property and give examples of polynomially orderable class...
متن کاملConvexly orderable Groups and Valued Fields
We consider the model theoretic notion of convex orderability, which fits strictly between the notions of VC-minimality and dp-minimality. In some classes of algebraic theories, however, we show that convex orderability and VC-minimality are equivalent, and use this to give a complete classification of VC-minimal theories of ordered groups and abelian groups. Consequences for fields are also co...
متن کاملΠ10 classes and strong degree spectra of relations
We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear order. Countable Π1 subsets of 2 ω and Kolmogorov complexity play a major role in the proof.
متن کاملDiagram Groups Are Totally Orderable
In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a partially commutative group and R. Thompson's group F. As a result, we prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2002
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00097-5